Intermodal Green p-Hub Median Problem with Incomplete Hub-Network

In the literature, hub-networks have often been modeled such as only one mode is considered for all transportation. Also, consolidated demand flows are assumed to be transferred directly between each origin-destination hub pairs. The previous assumptions impose restrictions on practical applications of hub-networks. fact, various transport modes usually retained freight transport, and intermodal terminals (e.g., rail terminals) may not realistically fully connected. Thus, assist decision makers, we investigate if appropriate use more eco-friendly transportation in incomplete networks contribute accomplishment significant global reduction goals carbon emissions. this paper, study green p-hub median problem with hub-network. For p located nodes, hub-network connected by at most q hub-links. objective minimize total transportation-based CO2 emission costs incurred through road- rail-transportation o-d flows. We present a MILP formulation studied propose novel genetic algorithm solve it. A penalty cost solutions where train capacity exceeded. Additionally, best-path construction heuristic generate initial population. Furthermore, develop routing efficiently determine partition road-rail network. And implement crossover mutation operators produce new off-springs. Extensive computational experiments show that proposed solution approach outperforms exact solver CPLEX. perform comparison unimodal cases, offer discussion tuning trains.